Verified Distance Computation Between Convex Hulls of Octrees Using Interval Optimization Techniques
نویسندگان
چکیده
منابع مشابه
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model we construct a hierarchical bounding representation based on spheres. The distance between objects is determined by computing the distance between pairs of convex components using preexisting techniques. The key to eff...
متن کاملConserved Interval Distance Computation Between Non-trivial Genomes
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene matching computation between two genomes [10, 3]. In this paper, we study the time complexity of the conserved interval distance computation considering duplicated genes using both those two strategies.
متن کاملMulti-Objective Optimization using Evolutionary Computation Techniques
In this paper an EP and PSO based optimization algorithms have been proposed for solving optimal power flow problems with multiple objective functions. These algorithms take into consideration all the equality and inequality constraints. The improvement in system performance is based on reduction in cost of power generation and active power loss. The
متن کاملConstructing Strongly Convex Hulls Using Exact or
One useful generalization of the convex hull of a set S of n points is the-strongly convex-hull. It is deened to be a convex polygon P with vertices taken from S such that no point in S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. It was an open question 1 as to whether an-strongly convex O()-hull existed for all positive. W...
متن کاملView Synthesis using Convex and Visual Hulls
This paper discusses two efficient methods for image based rendering. Both algorithms approximate the world object. One uses the convex hull and the other uses the visual hull. We show that the overhead of using the latter is not always justified and in some cases, might even hurt. We demonstrate the method on real images from a studio-like setting in which many cameras are used, after a simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2010
ISSN: 1617-7061
DOI: 10.1002/pamm.201010318